Finding extrema without resorting to calculus
نویسندگان
چکیده
منابع مشابه
Finding the Extrema of a Distributed Multiset
We consider the problem of nding the extrema of a distributed multiset in a ring; that is, of determining the minimum and the maximum values, x min and x max , of a multiset X = fx 0 ; x 2 ; :::; x n 1 g, whose elements are drawn from a totally ordered universe U and stored at the n entities of a ring network. This problem is unsolvable if the ring size is not known to the entities, and has com...
متن کاملOptimal Synthesis of Multipass Heat Exchanger without Resorting to Correction Factor
Customarily, the LMTD correction factor, FT, is used to screen alternative designs for a heat exchanger. Designs with unacceptably low FT values are discarded. In this paper, authors have proposed a more fundamental criterion, based on feasibility of a multipass exchanger as the only criteria, followed by economic optimization. This criterion, coupled with asymptotic energy targets, provide the...
متن کاملQuantum Algorithms for Finding Extrema with Unary Predicates
We study the problem of finding the maximum or the minimum of a given set S = {x0, x1, . . . xn−1}, each element xi drawn from some finite universe U of real numbers. We assume that the inputs are abstracted within an oracle O where we can only gain information through unary comparisons in the form ”Is xi greater than, equal to, or less than some constant k?” Classically, this problem is solved...
متن کاملAutomatic Metaphase Finding by Inter-chromosome Extrema Profile Analysis
In this paper we report our experiences with a new texture coarseness measure, as a step towards automation of metaphase finding in cell proliferation studies. This measure is highly specific to grey-level inter-chromosome coarseness features in microscopic images of metaphase spreads, and allows to quantify the texture of the cytological objects analysing the intensity profile between chromoso...
متن کاملEfficient Protection Against Heap-Based Buffer Overflows Without Resorting to Magic
Bugs in dynamic memory management, including for instance heap-based buffer overflows and dangling pointers, are an important source of vulnerabilities in C and C++. Overwriting the management information of the memory allocation library is often a source of attack on these vulnerabilities. All existing countermeasures with low performance overhead rely on magic values or canaries. A secret val...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Cogent Education
سال: 2018
ISSN: 2331-186X
DOI: 10.1080/2331186x.2018.1551299